A Classical Sequent Calculus with Dependent Types
نویسندگان
چکیده
منابع مشابه
A Classical Sequent Calculus with Dependent Types
Dependent types are a key feature of type systems, typically used in the context of both richly-typed programming languages and proof assistants. Control operators, which are connected with classical logic along the proof-as-program correspondence, are known to misbehave in the presence of dependent types, unless dependencies are restricted to values. We place ourselves in the context of the se...
متن کاملSecond-Order Classical Sequent Calculus
We present a sequent calculus that allows to abstract over a type variable. The introduction of the abstraction on the right-hand side of a sequent corresponds to the universal quantification; whereas, the introduction of the abstraction on the lefthand side of a sequent corresponds to the existential quantification. The calculus provides a correspondence with second-order classical proposition...
متن کاملApproaches to Polymorphism in Classical Sequent Calculus
X is a relatively new, untyped calculus, invented to give a CurryHoward correspondence with Classical Implicative Sequent Calculus. It is already known to provide a very expressive language; embeddings have been defined of the λ-calculus, Bloo and Rose’s λx, Parigot’s λμ and Curien and Herbelin’s λμμ̃. We investigate various notions of polymorphism in the context of the X -calculus. In particula...
متن کاملMonadic translation of classical sequent calculus
We study monadic translations of the call-by-name (cbn) and the call-by-value (cbv) fragments of the classical sequent calculus λμμ̃ by Curien and Herbelin and give modular and syntactic proofs of strong normalization. The target of the translations is a new meta-language for classical logic, named monadic λμ. It is a monadic reworking of Parigot’s λμ-calculus, where the monadic binding is confi...
متن کاملRepresenting the Classical Sequent Calculus in the π-calculus
We study the π-calculus, enriched with pairing and non-blocking input, and define a notion of type assignment that uses the type constructor →. We encode the circuits of the calculus X into this variant of π, and show that all reduction (cut-elimination) and assignable types are preserved. Since X enjoys the Curry-Howard isomorphism for Gentzen’s calculus LK, this implies that all proofs in LK ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Programming Languages and Systems
سال: 2019
ISSN: 0164-0925,1558-4593
DOI: 10.1145/3230625